Improved Algorithms for Theory Revision with Queries
نویسندگان
چکیده
Judy Goldsmith Dept. of Computer Science University of Kentucky 763 Anderson Hall Lexington, KY 40506 [email protected] Robert H. Sloan Dept. of EE & Comp. Sci. U. Illinois at Chicago 851 S. Morgan St. Rm 1120 Chicago, IL 60607-7053 [email protected] Balázs Szörényi Dept. of Computer Science University of Szeged Hungary [email protected] György Turán Math, Stat., & CS Dept. U. Illinois at Chicago, Research Group on AI Hungarian Acad. of Sciences [email protected]
منابع مشابه
بهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملTheory revision with queries: results and problems
A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas, and threshold functions. Several open problems are formulated for revision in propositional and predicate logic, and finite automata.
متن کاملThe Complexity of Theory Revision
A knowledge-based system uses its database (a.k.a. its \theory") to produce answers to the queries it receives. Unfortunately, these answers may be incorrect if the underlying theory is faulty. Standard \theory revision" systems use a given set of \labeled queries" (each a query paired with its correct answer) to transform the given theory, by adding and/or deleting either rules and/or antecede...
متن کاملارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملWitness Finding in the Black-Box Setting
We propose an abstract framework for studying search-to-decision reductions for NP. Specifically, we study the following witness finding problem: for a hidden nonempty set W ⊆ {0, 1}, the goal is to output a witness in W with constant probability by making randomized queries of the form “is Q ∩ W nonempty?” where Q ⊆ {0, 1}. Algorithms for the witness finding problem can be seen as a general fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000